Optimal Proposal Distributions and Adaptive MCMC by Jeffrey
نویسنده
چکیده
We review recent work concerning optimal proposal scalings for Metropolis-Hastings MCMC algorithms, and adaptive MCMC algorithms for trying to improve the algorithm on the fly.
منابع مشابه
Optimal Proposal Distributions and Adaptive MCMC
We review recent work concerning optimal proposal scalings for Metropolis-Hastings MCMC algorithms, and adaptive MCMC algorithms for trying to improve the algorithm on the fly.
متن کاملErgodicity of Adaptive MCMC and its Applications by Chao Yang
Ergodicity of Adaptive MCMC and its Applications Chao Yang Doctor of Philosophy Graduate Department of Statistics University of Toronto 2008 Markov chain Monte Carlo algorithms (MCMC) and Adaptive Markov chain Monte Carlo algorithms (AMCMC) are most important methods of approximately sampling from complicated probability distributions and are widely used in statistics, computer science, chemist...
متن کاملAdaptive Gibbs samplers and related MCMC methods
We consider various versions of adaptive Gibbs and Metropoliswithin-Gibbs samplers, which update their selection probabilities (and perhaps also their proposal distributions) on the fly during a run, by learning as they go in an attempt to optimise the algorithm. We present a cautionary example of how even a simple-seeming adaptive Gibbs sampler may fail to converge. We then present various pos...
متن کاملAdaptive independence samplers
Markov chain Monte Carlo (MCMC) is an important computational technique for generating samples from non-standard probability distributions. A major challenge in the design of practical MCMC samplers is to achieve efficient convergence and mixing properties. One way to accelerate convergence and mixing is to adapt the proposal distribution in light of previously sampled points, thus increasing t...
متن کاملImplementing componentwise Hastings algorithms
Markov chain Monte Carlo (MCMC) routines have revolutionized the application of Monte Carlo methods in statistical application and statistical computing methodology. The Hastings sampler, encompassing both the Gibbs and Metropolis samplers as special cases, is the most commonly applied MCMC algorithm. The performance of the Hastings sampler relies heavily on the choice of sweep strategy, that i...
متن کامل